Algebraic Connectivity of Finite-element Hypergraphs
نویسندگان
چکیده
This paper generalizes results that relate the connectivity of a weighted graph to the smallest nonzero eigenvalue of the graph’s Laplacian matrix. We generalize these results to hypergraphs with vector-valued vertices and matrix-valued edges. Our definitions of hypergraphs and their connectivity are designed to model finite-element meshes. The physical interpretation of our results is as follows. We say that a structure modeled by a finiteelement model is weak if its vertices can be displaced by a unit perturbation orthogonal to its rigid motions with only a small investment of energy (or work, virtual work, etc.) Given a partition of the vertices of a finiteelement model, a displacement is a cut displacement if under that displacement, energy is expanded only in elements incident on vertices in both subsets of the partition. Our goal is to show that a structure is weak if and only if it has a weak cut. Our analysis is purely algebraic and can be applied to finite-elements models from several application domains. Our ultimate objective is to find ways to construct socalled support preconditioners ([2],[3]) for finite-element matrices. The analysis of existing support preconditioners is based on relating generalized eigenvalues of the Laplacians to complex combinatorial properties of pairs of their graphs. We believe that studying the simpler relationship of a simple eigenvalue to the connectivity of a hypergraph will eventually help us develop support preconditioners for hypergraphs.
منابع مشابه
ON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملComputing The Analytic Connectivity of A Uniform Hypergraph
The analytic connectivity, proposed as a substitute of the algebraic connectivity in the setting of hypergraphs, is an important quantity in spectral hypergraph theory. The definition of the analytic connectivity for a uniform hypergraph involves a series of polynomial optimization problems (POPs) associated with the Laplacian tensor of the hypergraph with nonnegativity constraints and a sphere...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005